Search results for "Bounding overwatch"
showing 10 items of 24 documents
New delay-dependent stability of Markovian jump neutral stochastic systems with general unknown transition rates
2015
This paper investigates the delay-dependent stability problem for neutral Markovian jump systems with generally unknown transition rates GUTRs. In this neutral GUTR model, each transition rate is completely unknown or only its estimate value is known. Based on the study of expectations of the stochastic cross-terms containing the integral, a new stability criterion is derived in terms of linear matrix inequalities. In the mathematical derivation process, bounding stochastic cross-terms, model transformation and free-weighting matrix are not employed for less conservatism. Finally, an example is provided to demonstrate the effectiveness of the proposed results.
Bounding Techniques and Their Application to Simplified Plastic Analysis of Structures
1990
In the framework of the simplified analysis methods for elastoplastic analysis problems, the bounding techniques possess an important role. A class of these techniques, based on the so-called perturbation method, are here presented with reference to finite element discretized structures. A general bounding principle is presented and its applications are illustrated by means of numerical examples.
Bounding principles for elastic-plastic-creeping solids loaded below and above the shakedown limit
1982
Solids of elastic-perfectly plastic creeping material subjected to variable loads are considered within the infinitesimal displacement framework and a bounding principle is presented which holds below and above the shakedown limit. Through the choice of some free parameters, this principle generates a number of deformation bounds with practical meanings, some of wich coincide with known results for creeping and noncreeping material, while others constitute new results or generalizations of known results. The topic will be further studied in a subsequent paper [35].
Understanding Quantum Algorithms via Query Complexity
2017
Query complexity is a model of computation in which we have to compute a function $f(x_1, \ldots, x_N)$ of variables $x_i$ which can be accessed via queries. The complexity of an algorithm is measured by the number of queries that it makes. Query complexity is widely used for studying quantum algorithms, for two reasons. First, it includes many of the known quantum algorithms (including Grover's quantum search and a key subroutine of Shor's factoring algorithm). Second, one can prove lower bounds on the query complexity, bounding the possible quantum advantage. In the last few years, there have been major advances on several longstanding problems in the query complexity. In this talk, we su…
Numerical Modelling of Room Thermal Comfort Conditions
2006
Particular heat transfer coefficients of building elements gives quantitative notion only about heat losses through this building element. Analysis of the overall heat balance and heat losses of complete building and study of particular contribution of building elements in overall balance allows one to figure out the state of the building and find the building elements of bounding construction with most significant heat losses. Project variants of the buildings (or rebuilding in case of renovation), which ensure the desirable economy of energy and proportions of investments can be find varying the proportions of the surface area of building elements (e.g., windows and doors). A lot of facto…
Bounding the number of vertices in the degree graph of a finite group
2020
Abstract Let G be a finite group, and let cd ( G ) denote the set of degrees of the irreducible complex characters of G . The degree graph Δ ( G ) of G is defined as the simple undirected graph whose vertex set V ( G ) consists of the prime divisors of the numbers in cd ( G ) , two distinct vertices p and q being adjacent if and only if pq divides some number in cd ( G ) . In this note, we provide an upper bound on the size of V ( G ) in terms of the clique number ω ( G ) (i.e., the maximum size of a subset of V ( G ) inducing a complete subgraph) of Δ ( G ) . Namely, we show that | V ( G ) | ≤ max { 2 ω ( G ) + 1 , 3 ω ( G ) − 4 } . Examples are given in order to show that the bound is bes…
Computer-aided detection of cerebral microbleeds in susceptibility-weighted imaging.
2014
Susceptibility-weighted imaging (SWI) is recognized as the preferred MRI technique for visualizing cerebral vasculature and related pathologies such as cerebral microbleeds (CMBs). Manual identification of CMBs is time-consuming, has limited reliability and reproducibility, and is prone to misinterpretation. In this paper, a novel computer-aided microbleed detection technique based on machine learning is presented: First, spherical-like objects (potential CMB candidates) with their corresponding bounding boxes were detected using a novel multi-scale Laplacian of Gaussian technique. A set of robust 3-dimensional Radon- and Hessian-based shape descriptors within each bounding box were then ex…
A Linear Programming Method for Bounding Plastic Deformations
1988
A method for providing upper and lower bounds to plastic deformations is presented, which has the feature of being applicable both below and above the structure shakedown limit. The bounds provided are expressed in terms of some fictitious plastic strains obeying relaxed yielding laws, whose evaluation is made by means of a suitable LP-based algorithm.
Approximation of the Feasible Parameter Set in worst-case identification of Hammerstein models
2005
The estimation of the Feasible Parameter Set (FPS) for Hammerstein models in a worst-case setting is considered. A bounding procedure is determined both for polytopic and ellipsoidic uncertainties. It consists in the projection of the FPS of the extended parameter vector onto suitable subspaces and in the solution of convex optimization problems which provide Uncertainties Intervals of the model parameters. The bounds obtained are tighter than in the previous approaches. hes.
A cutting plane algorithm for the capacitated arc routing problem
2003
The Capacitated Arc Routing Problem (CARP) consists of finding a set of minimum cost routes that service all the positive-demand edges of a given graph, subject to capacity restrictions.In this paper, we introduce some new valid inequalities for the CARP. We have designed and implemented a cutting plane algorithm for this problem based on these new inequalities and some other which were already known. Several identification algorithms have been developed for all these valid inequalities. This cutting plane algorithm has been applied to three sets of instances taken from the literature as well as to a new set of instances with real data, and the resulting lower bound was optimal in 47 out of…